Bootstrapping a Biodiversity Knowledge Graph

نویسندگان

چکیده

The "biodiversity knowledge graph" is a nice metaphor for connecting biodiversity data sources, but can we actually build it? Do have sufficient linked available? Given that graph an aggregation of from multiple how do give those sources credit data, and handle changes to data? the classic interface intimidatingly empty SPARQL query box, make within more accessible? This talk discusses attempt with eye on maintain in future. It adopts model similar Global Biodiversity Information Facility (GBIF) CheckListBank where individual providers datasets available as independently citable units Digital Object Identifiers (DOIs). Each dataset comprises form N-triples. To create simply download one or such add them triple store. source assigned its own named graph, provenance each dataset, update any independently. Furthermore, anyone their by mixing matching set (people, publications, taxa, etc.) most appropriate interests. bootstrap this approach, exemplar are created based harvested ORCID, Zenodo, taxonomic name databases. demonstration could be replaced future published directly providers. In some cases there shared identifiers (such DOIs ORCIDs) typically forms isolated islands. help coalesce need "glue" link pairs different identifiers, Life Science (LSIDs) names publications. With addition cross links start generate bibliographies discover communities expertise, more. building also opens opportunities smaller, focussed added using same approach (as N-triples archived online repository). order useful, needs easy visualise. Simply providing endpoint unlikely enough. As part project, I developed GraphQL provide standard queries support simple web graph. provides way explore it being developed, which turn highlight gaps connectivity coverage addressed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bootstrapping via Graph Propagation

Bootstrapping a classifier from a small set of seed rules can be viewed as the propagation of labels between examples via features shared between them. This paper introduces a novel variant of the Yarowsky algorithm based on this view. It is a bootstrapping learning method which uses a graph propagation algorithm with a well defined objective function. The experimental results show that our pro...

متن کامل

Bootstrapping Knowledge Base Acceleration

The Streaming Slot Filler (SSF) task in TREC Knowledge Base Acceleration track involves detecting changes to slot values (relations) over time. To handle this task, the system needs to extract relations to identify slot-filler values and detect novel values. Being the first attempt at KBA, the biggest challenge that we faced was the scale of the data. We present the approach used by University ...

متن کامل

Supporting knowledge discovery for biodiversity

A proposal for text mining as a support for knowledge discovery on biological descriptions is introduced. Our aim is both to sustain the curation of databases and to offer an alternative representation frame for accessing information in the biodiversity domain. We works on raw texts with minimum human intervention, applying natural language processing to integrate linguistic and domain knowledg...

متن کامل

Recommendations on a Knowledge Graph

Most recommender system methods derive the user preferences from predefined information sources. For example, collaborative filtering is based on user rating values on items. Predefining information sources constrains the quality of the recommendation result by restricting the amount of information the recommendation method can operate on. In this paper we introduce an adaptive rating estimatio...

متن کامل

Learning Semantic Lexicons using Graph Mutual Reinforcement based Bootstrapping

Bootstrapping has been received a amount of attentions in many fields and achieved good results. While semantic lexicons also have been proved to be useful for many natural language processing tasks. This paper presents an approach to learn semantic lexicons using a new bootstrapping method which is based on Graph Mutual Reinforcement. The approach uses only unlabeled data and a few of seed wor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Biodiversity Information Science and Standards

سال: 2022

ISSN: ['2535-0897']

DOI: https://doi.org/10.3897/biss.6.91497